Fully Retroactive Priority Queues using Persistent Binary Search Trees
نویسندگان
چکیده
منابع مشابه
Polylogarithmic Fully Retroactive Priority Queues via Hierarchical Checkpointing
Since the introduction of retroactive data structures at SODA 2004 [1], a major open question has been the difference between partial retroactivity (where updates can be made in the past) and full retroactivity (where queries can also be made in the past). In particular, for priority queues, partial retroactivity is possible in O(logm) time per operation on a m-operation timeline, but the best ...
متن کاملTransforming Binary Sequences Using Priority Queues
A priority queue transforms an input sequence ~r into an output sequence r which is a re-ordering of the sequence ~r. The set R of all such related pairs is studied in the case that tr is a binary sequence. It is proved that R is a partial order and that IRI = c,~+1, the (n + 1)th Catalan number, An efficient (O(n2)) algorithm is given for computing the number of outputs achievable from a given...
متن کاملFully persistent B-trees
We present I/O-efficient fully persistent B-Trees that support range searches at any version in O(logB n + t/B) I/Os and updates at any version in O(logB n + log2 B) amortized I/Os, using space O(m/B) disk blocks. By n we denote the number of elements in the accessed version, by m the total number of updates, by t the size of the query’s output, and by B the disk block size. The result improves...
متن کاملPriority Queues Based on Braun Trees
This theory implements priority queues via Braun trees. Insertion and deletion take logarithmic time and preserve the balanced nature of Braun trees.
متن کاملProfile and Height of Random Binary Search Trees
The purpose of this article is to survey recent results on distributional properties of random binary search trees. In particular we consider the profile and the height.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer Science
سال: 2020
ISSN: 1549-3636
DOI: 10.3844/jcssp.2020.906.915